Deciding hypergraph 2-colourability by H-resolution
نویسندگان
چکیده
منابع مشابه
Deciding Hypergraph 2-Colourability by H-Resolution
Deciding whether a hypergraph is 2-colourable is a computational problem which contains the satisfiability problem in propositional calculus as a special case. We present a method for deciding the 2-colourability of hypergraphs. This method which we call H-resolution is closely related to resolution of boolean formulas and the relation.between the two is investigated.
متن کاملDeciding H1 by resolution
Nielson, Nielson and Seidl’s class H1 is a decidable class of first-order Horn clause sets, describing strongly regular relations. We give another proof of decidability, and of the regularity of the defined languages, based on fairly standard automated deduction techniques.
متن کاملDeciding the guarded fragments by resolution
The guarded fragment is a fragment of first-order logic that has been introduced for two main reasons: First, to explain the good computational and logical behavior of propositional modal logics. Second, to serve as a breeding ground for well-behaved process logics. In this paper we give resolution-based decision procedures for the guarded fragment and for the loosely guarded fragment (sometime...
متن کاملDeciding Monodic Fragments by Temporal Resolution
In this paper we study the decidability of various fragments of monodic first-order temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic temporal resolution and finegrained temporal resolution. For the first, we state a very general decidability result, which is independent of the particular decision procedure used to decide the first-order part of the logi...
متن کاملApproximability Distance in the Space of H-Colourability Problems
A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. We study the approximability properties of the Weighted MaximumH-Colourable Subgraph problem (MAX H -COL). The instances of this problem are edge-weighted graphs G and the objective is to find a subgraph of G that has maximal total edge weight, under the condition that the subgraph has a hom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1985
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90227-0